Fast decoding of codes from algebraic plane curves

Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve we correct up to d*/2 m2/8 + m /4 9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3), where n is the length of the code. For codes from Hermitian curves the complexity of finding the error values, given the error locator, is 0( n’), and the same complexity can be obtained in the general case if we only correct d”f2 m2/2 errors.